Apparatus for providing error correction capability to longitudinal position data

ABSTRACT

A method and apparatus for providing error correction capability to longitudinal position data are disclosed. Initially, data are encoded via a set of even LPOS words and a set of odd LPOS words. The encoded data are then decoded by generating a set of syndrome bits for each of the LPOS words. A determination is then made as to whether or not there is an error within one of the LPOS words based on its corresponding syndrome bits.

PRIORITY CLAIM

The present application is a continuation of U.S. patent applicationSer. No. 11/205,713, filed on Aug. 17, 2005, now U.S. Pat. No.7,421,640, issued Sep. 2, 2008, and entitled, “Method and Apparatus forProviding Error Correction Capability to Longitudinal Position Data,”which is incorporated herein by reference.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is related to copending U.S. patent applicationSer. No. 12,141,962, filed concurrently and incorporated herein byreference.

BACKGROUND OF THE INVENTION

1. Technical Field

The present invention relates to tape storage systems in general. Moreparticularly, the present invention relates to a method and apparatusfor providing longitudinal position (LPOS) data in a tape storagesystem. Still more particularly, the present invention relates to amethod and apparatus for providing error correction capability to LPOSwords in a tape storage system.

2. Description of Related Art

Tape storage systems remain to be the most efficient and cost-effectivemeans for providing data backup because no other storage technologyoffers the same low cost and high capacity combined advantage. Inaddition, tape storage systems have been proven to be very reliable.

By combining the advantages of linear multi-channel bi-directional tapeformats in common usage, Linear Tape-Open (LTO) technology has beendeveloped to maximize capacity and performance of tape storage systems.LTO tapes use a tape format that has longitudinally pre-written servotracks. The servo tracks provide a timing-based track-following positionerror scheme. The servo tracks contain a repeated pattern of recordedflux transitions that occur in grouped bursts of 5, 5, 4 and 4transitions. The timing between the sets of five-bursts and between setsof four-bursts provides the position information for track following.Additionally, the individual transitions within the five-bursts arephase-shifted in a manner that encodes longitudinal position information(LPOS) into the servo tracks.

The LPOS information are used to keep track of the longitudinal positionof data records written onto or read from a tape, and are used to locatethose data records when the reading or writing process temporarilystops. By detecting the phase-encoded LPOS information, a tape storagesystem is able to determine the tape position relative to landmarkslengthwise down a tape. The LPOS locations of data files on tape arealso stored in the volume control data for use to locate the data filesduring a later tape cartridge load for reading, or for write-appendingnew files onto the end of the last file written to the tape. The LPOSdata are used as the primary positional information for the tape storageservo control system to determine the starting and stopping of a tape,and to back-hitch the tape in order to position the read-write heads atthe beginning of a data record at the required velocity and trackposition that allows the start of a new data transfer operation.

LPOS data typically cannot tolerate any errors. But if a tape drive isreduced to a single channel because other servo heads have been smearedor shorted, a single bit error on that channel can cause a Stop Writecondition. Thus, LPOS data have to able to tolerate some level of errorssuch that the good servo head can continue to operate after anoccurrence of an error.

One known solution to the above-mentioned problem is to appendReed-Solomon parity symbols to an LPOS word, but it would increase thelength of the LPOS word, and it would cause problems in synchronizing tothe LPOS word since Reed-Solomon words are not base-14 as required bythe LPOS format in order to allow for synchronization. Another solutionis to add a base-14 checksum, but again it would increase the length ofthe LPOS word, and it only provides error detection but not errorcorrection.

Consequently, it would be desirable to provide an improved method andapparatus for providing error correction capability to LPOS words.

SUMMARY OF THE INVENTION

In accordance with a preferred embodiment of the present invention, dataare initially encoded via a set of even LPOS words and a set of odd LPOSwords. The encoded data are then decoded by generating a set of syndromebits for each of the LPOS words. A determination is then made as towhether or not there is an error within one of the LPOS words based onits corresponding syndrome bits.

All features and advantages of the present invention will becomeapparent in the following detailed written description.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention itself, as well as a preferred mode of use, furtherobjects, and advantages thereof, will best be understood by reference tothe following detailed description of an illustrative embodiment whenread in conjunction with the accompanying drawings, wherein:

FIG. 1 is a block diagram of a tape library system in which a preferredembodiment of the present invention can be incorporated;

FIG. 2 is a block diagram of a tape drive in which a preferredembodiment of the present invention can be incorporated;

FIG. 3 illustrates a recording format on a magnetic tape, in accordancewith a preferred embodiment of the present invention; and

FIG. 4 is a high-level logic flow diagram of a method for providingerror correction capability to longitudinal position words within a tapestorage system, in accordance with a preferred embodiment of the presentinvention.

DETAILED DESCRIPTION OF A PREFERRED EMBODIMENT

Referring now to the drawings, and specifically to FIG. 1, there isdepicted a tape library system in which a preferred embodiment of thepresent invention can be incorporated. As shown, a tape library system10 includes tape drives 11-12, a loader 15, and a library of tapecassettes (or cartridges) 14. Loader 15 can fetch any one of tapecassettes 14 and loads it into one of tape drives 11-12.

With reference now to FIG. 2, there is depicted a tape drive, such astape drive 11 from FIG. 1, in which a preferred embodiment of thepresent invention can be incorporated. As shown, a tape drive 11includes a tape read/write head 23, takeup reels 24-25 and takeup reelmotors 26-27. A magnetic tape 22 is spooled on takeup reels 24-25, andis routed over tape read/write head 23. Tape read/write head 23 readsdata from and writes data to magnetic tape 22. Takeup reel motors 26-27control the positioning of magnetic tape 22 over tape read/write head 23via takeup reels 24-25, respectively.

In addition, a controller 30 provides control signals to motor drivers28-29. Motor drivers 28-29, in turn, provide drive signals to takeupreel motors 26-27, respectively. Position encoders 31-32 commutatestakeup reel motors 26-27, respectively. Longitudinal position (LPOS)information are used to cause controller 30 to move magnetic tape 22over the entire length of magnetic tape 22, to rewind from the end ofmagnetic tape 22 to the beginning of magnetic tape 22 and unspool,unthread, etc.

Referring now to FIG. 3, there is illustrated a recording format on amagnetic tape, such as magnetic tape 22 from FIG. 2, in accordance witha preferred embodiment of the present invention. As shown, magnetic tape22 includes servo bands 0-4 to enable an accurate positioning of a taperead/write head over a data track, and to ensure that the taperead/write head does not stray onto an adjacent data track. Servo bands0-4 are written on magnetic tape 22 at time of manufacture. Each ofservo bands 0-4 is located at a specific distance from a tape referenceedge 33. Within each of servo bands 0-4 are servo stripes, groups ofwhich make up servo bursts. Four servo bursts make up a servo frame. Forexample, in servo band 0, a servo frame includes servo bursts 34-35.First two servo bursts 34 contain five flux transitions, and second twoservo bursts 35 contain four flux transitions.

In the prior art, an LPOS word includes one sync mark and seven 14-arysymbols (written in a forward tape motion direction), as follows:Sy,L0,L1,L2,L3,L4,L5,Tx

where

-   -   Sy is the word sync mark    -   L0 is the least significant symbol in longitudinal position    -   L1 is the next most significant symbol in longitudinal position    -   L2 is the next most significant symbol in longitudinal position    -   L3 is the next most significant symbol in longitudinal position    -   L4 is the next most significant symbol in longitudinal position    -   L5 is the next most significant symbol in longitudinal position    -   Tx is a symbol of tape manufacturer information        LPOS word symbols are constructed from a set of bit sequences        listed in Table I. The most significant bit within each LPOS        word symbol is encoded into a servo subframe first. An LPOS word        contains 36 bits and has a length of 36 servo frames.

TABLE I symbol bit sequence Sy 10000000 D 0001 C 0010 B 0011 A 0100 90101 8 0110 7 0111 6 1001 5 1010 4 1011 3 1100 2 1101 1 1110 0 1111

In accordance with a preferred embodiment of the present invention, LPOSinformation is initially represented by an even LPOS word and an oddLPOS word (or vice versa), followed by a group of LPOS words that aremade up of a combination of even or odd LPOS words. Each of even and oddLPOS words includes one sync mark and seven 14-ary symbols (written in aforward tape motion direction), as follows:even LPOS word: Sy,L0,L1,L2,L3,X,Y,Txodd LPOS word: Sy,L0,L1,L4,L5,X,Y,Tx

where

-   -   Sy is the word sync mark    -   L0 is the least significant symbol in longitudinal position    -   L1 is the next most significant symbol in longitudinal position    -   L2 is the next most significant symbol in longitudinal position    -   L3 is the next most significant symbol in longitudinal position    -   L4 is the next most significant symbol in longitudinal position    -   L5 is the next most significant symbol in longitudinal position    -   Tx is a symbol of tape manufacturer information    -   X, Y are 8 bits of (d=0, k=3) runlength-limited (RLL)        constrained error correction code that are encoded as the        following 8 bits: a, b, c, 1, d, e, f, 1, where a, b, c, d, e,        and f are six parity bits associated with a shortened extended        Hamming code (generating a Hamming distance of 4, which is        capable of correcting any one-bit error and detecting any        two-bit error) over:        -   even LPOS word: L0, L1, L2, L3, and Tx where L0 is 0, 2, . .            . , 12        -   odd LPOS word: L0, L1, L4, L5, and Tx where L0 is 1, 3, . .            . , 13

The two 1's RLL constrain the X,Y bit sequence so that no false Sy isseen.

Mappings for the 14-ary symbols in an even LPOS word (i.e., L0 L1 L2 L3X Y Tx) and mappings for the 14-ary symbols in an odd LPOS word (i.e.,L0 L1 L4 L5 X Y Tx) are as follows:

-   -   L0 bits: u₁ u₂ u₃ u₄    -   L1 bits: u₅ u₆ u₇ u₈    -   L2 or L4 bits: u₉ u₁₀ u₁₁ u₁₂    -   L3 or L5 bits: u₁₃ u₁₄ u₁₅ u₁₆    -   X bits: a b c 1    -   Y bits: d e f 1    -   Tx bits: u₁₇ u₁₈ u₁₉ u₂₀        LPOS word symbols are constructed from the bit sequences shown        in Table I, and for each of L0-L5 and Tx bits, each of u_(i) . .        . u_(j) corresponds to a bit in the bit sequence in Table I. For        example, if L0=5, then the bit sequence for L0, according to        Table I, should be 1010, which means u₁=1, u₂=0, u₃=1, u₄=0. As        another example, if L2=8, then the bit sequence for L1,        according to Table I, should be 0110, which means u₉=0, u₁₀=1,        u₁₁=1, u₁₂=0.

An encoder is used to compute the parity bits a, b, c, d, e and f as afunction of u₁ . . . u₂₀. Within the encoder, the following computationsare performed:a=u₁⊕u₅⊕u₆⊕u₉⊕u₁₁⊕u₁₄⊕u₁₅⊕u₁₆⊕u₁₈⊕u₂₀b=u₁⊕u₂⊕u₇⊕u₁₀⊕u₁₁⊕u₁₂⊕u₁₅⊕u₁₆⊕u₁₇⊕u₁₉c=u₂⊕u₃⊕u₆⊕u₈⊕u₁₁⊕u₁₂⊕u₁₃⊕u₁₇⊕u₁₈⊕u₂₀d=u₃⊕u₄⊕u₇⊕u₉⊕u₁₂⊕u₁₃⊕u₁₄⊕u₁₆⊕u₁₈⊕u₁₉e=u₄⊕u₅⊕u₈⊕u₁₀⊕u₁₃⊕u₁₄⊕u₁₅⊕u₁₇⊕u₁₉⊕u₂₀f=u₁⊕u₂⊕u₃⊕u₄⊕u₅⊕u₆⊕u₇⊕u₈⊕u₉⊕u₁₀where ⊕ stands for an exclusive OR operation (i.e., modulo 2 addition).Preferably, a total of 54 exclusive OR logic gates are required toimplement the encoder, and a total of nine exclusive OR gates are usedto compute each of the parity bits a-f.

The values of u₁ . . . u₂₀ for forming parity bits a-f are based on a6×26 parity check matrix H=[h₁ h₂ h₃ . . . h₂₀ h₂₁ h₂₂ h₂₃ h₂₄ h₂₅ h₂₆],where h_(i) is the i^(th) column vector of matrix H given by:

$H = \left\lbrack \begin{matrix}10001100101001110101100000 \\11000010011100111010010000 \\11000010011100111010010000 \\00110010100111010110000100 \\00011001010011101011000010 \\11111111110000000000000001\end{matrix}\mspace{14mu} \right\rbrack$

A decoder is used to compute six syndrome bits s₁ . . . s₆. The decoderthen determines whether or not there is an error in an LPOS word basedon the values of the computed syndrome bits. Within the decoder, thefollowing computations are performed:s₁=a′⊕u′₁⊕u′₅⊕u′₆⊕u′₉⊕u′₁₁⊕u′₁₄⊕u′₁₅⊕u′₁₆⊕u′₁₈⊕u′₂₀s₂=b′⊕u′₁⊕u′₂⊕u′₇⊕u′₁₀⊕u′₁₁⊕u′₁₂⊕u′₁₅⊕u′₁₆⊕u′₁₇⊕u′₁₉s₃=c′⊕u′₂⊕u′₃⊕u′₆⊕u′₈⊕u′₁₁⊕u′₁₂⊕u′₁₃⊕u′₁₇⊕u′₁₈⊕u′₂₀s₄=d′⊕u′₃⊕u′₄⊕u′₇⊕u′₉⊕u′₁₂⊕u′₁₃⊕u′₁₄⊕u′₁₆⊕u′₁₈⊕u′₁₉s₅=e′⊕u′₄⊕u′₅⊕u′₈⊕u′₁₀⊕u′₁₃⊕u′₁₄⊕u′₁₅⊕u′₁₇⊕u′₁₉⊕u′₂₀s₆=f′⊕u′₁⊕u′₂⊕u′₃⊕u′₄⊕u′₅⊕u′₆⊕u′₇⊕u′₈⊕u′₉⊕u′₁₀where ⊕ stands for an exclusive OR operation. Preferably, a total of 60exclusive OR logic gates are required to compute syndrome bits, and atotal of 10 exclusive OR logic gates are used to compute each syndromebit. The prime notation denotes a received bit (e.g., a′ is the receivedbit a, b′ is the received bit b, u′₁ is the received bit u₁, u′₂ is thereceived bit u₂, etc.), which can be potentially in error. The decoderconsiders three separate cases and makes a decision in each of the threecases as follows.Case 1: s₁+s₂+s₃+s₄+s₅+s₆=0 or 1In case 1, if all the received 4-bit data nibbles are valid 14-arynibbles, nothing is done (i.e., no error is corrected in bits u′₁ . . .u′₂₀). In the present example, u₁=u′₁, . . . , u₂₀=u′₂₀ are declared bythe decoder, where u₁ . . . u₂₀ are the decoder's data estimates.However, if at least one of the received 4-bit nibbles is not valid, anerror detection flag is raised.Case 2: s₁+s₂+s₃+s₄+s₅+s₆=2 or 4 or 5 or 6In case 2, an error detection flag is raised.Case 3: s₁+s₂+s₃+s₄+s₅+s₆=3In case 3, depending on the values of the syndrome bits, a particularsingle bit among bits u′₁ . . . u′₂₀ is “flipped.” Specifically, if thesyndrome vector in column form is equal to the i^(th) column vector ofthe parity check matrix H, i=1, 2, . . . , 20, then the i^(th) bitu′_(i) is “flipped.” In other words, if [s₁ s₂ s₃ s₄ s₅ s₆]^(t)=h_(i),where i=1, 2, . . . , 20, then the i^(th) bit u′_(i) is “flipped,” wheret denotes the transpose operation. The decoder then concludesu_(i)=u′_(i)⊕1, and u_(j)=u′_(j) if j is not equal to i. If all the datanibbles with the data estimate after error correction u_(i), where i=1,2, . . . , 20, are valid 14-ary nibbles, the decoding is complete.However, if one of the data nibbles after error correction is not avalid 14-ary nibble, an error detection flag is raised.

For each new LPOS word sequence, a tape drive needs to first read twoLPOS words consecutively in order to fully land a seek position sinceL0, L1, L2, L3, L4, and L5 are required. But after the first two LPOSwords (i.e., L2 through L5) are known and can be updated, only one LPOSword is then required for subsequent updates.

With reference now to FIG. 4, there is depicted a high-level logic flowdiagram of a method for providing error correction capability tolongitudinal position words within a tape storage system, in accordancewith a preferred embodiment of the present invention. Starting at block40, data are initially encoded via a set of even LPOS words and a set ofodd LPOS words, as shown in block 41. The encoded data can be decoded bygenerating a set of syndrome bits for each of the LPOS words, asdepicted in block 42. Then, a determination is made as to whether or notthere is an error in an LPOS word based on its corresponding syndromebits. If the sum of the syndrome bits equals 0 or 1, then there is noerror in the LPOS word, as shown in block 43. If the sum of the syndromebits equals 3, then there is an error in one of the bits of the LPOSword, as depicted in block 44. If the sum of the syndrome bits equals 2,4, 5 or 6, then there is more than one error in the bits of the LPOSword, as shown in block 45.

As has been described, the present invention provides an improved methodand apparatus for providing error correction capability to LPOS words.The method of the present invention allows a single-bit error to becorrected and a double-bit error to be detected without increasing theLPOS word length. The particular (n,k)=(26,20) extended shortenedHamming code that was designed can correct all single errors and detectall double errors. In addition, the method of the present invention candetect 20.77% of all possible triple errors (three errors at anyposition) and 96.55% of all quadruple errors (four errors at anyposition).

It is also important to note that although the present invention hasbeen described in the context of hardware, those skilled in the art willappreciate that the mechanisms of the present invention are capable ofbeing distributed as a program product in a variety of forms, and thatthe present invention applies equally regardless of the particular typeof signal bearing media utilized to actually carry out the distribution.Examples of signal bearing media include, without limitation, recordabletype media such as floppy disks or compact discs and transmission typemedia such as analog or digital communications links.

While the invention has been particularly shown and described withreference to a preferred embodiment, it will be understood by thoseskilled in the art that various changes in form and detail may be madetherein without departing from the spirit and scope of the invention.

1. A tape storage system having error correction capability forlongitudinal position (LPOS) words, said tape storage system comprising:means for encoding data via a plurality of even LPOS words and aplurality of odd LPOS words; means for decoding said encoded data,wherein said decoding means includes means for generating a plurality ofsyndrome bits for each of said LPOS words; and means for determiningwhether or not there is an error within one of said LPOS words based onits corresponding syndrome bits.
 2. The tape storage system of claim 1,wherein one of said even LPOS words includes Sy, L0,L1, L2, L3, X, Y,Tx, and one of said odd LPOS words includes Sy, L0, L1, L4, L5, X, Y, Txwhere Sy is a word sync mark L0 is the least significant symbol inlongitudinal position L1 is the next most significant symbol inlongitudinal position L2 is the next most significant symbol inlongitudinal position L3 is the next most significant symbol inlongitudinal position L4 is the next most significant symbol inlongitudinal position L5 is the next most significant symbol inlongitudinal position Tx is a symbol of tape manufacturer information X,Y are runlength-limited (RLL) constrained error correction code that areencoded as the following 8 bits: a, b, c, 1, d, e, f, 1, where a, b, c,d, e, and f are six parity bits associated with a shortened extendedHamming code.
 3. The tape storage system of claim 1, wherein said tapestorage system further includes means for concluding there is no errorin said one LPOS word if a syndrome hit sum of said one :LPOS wordequals 0 or
 1. 4. The tape storage system of claim 1, wherein said tapestorage system further includes means for concluding there is a one-biterror in said one LPOS word if a syndrome bit sum of said one LPOS wordequals
 3. 5. The tape storage system of claim 1, wherein said tapestorage system further includes means for concluding there is more thanone hit error in said one LPOS word if a syndrome bit sum of said oneLPOS word equals 2, 4, 5 or 6.